Order Barrier for Low-Storage DIRK Methods with Positive Weights
نویسندگان
چکیده
منابع مشابه
On the necessity of negative coefficients for high order DIRK Low-Storage methods
containing terms with different stiffness properties. This kind of problems may arise from the semidiscretization of some partial differential equations. Depending on the spatial discretization, a high dimension ODE system may appear, compromising the computer memory capacity. Thus it is important to incorporate low memory usage to some other properties of the additive scheme. These ideas have ...
متن کاملRounding Methods for Neural Networks with Low Resolution Synaptic Weights
Neural network algorithms simulated on standard computing platforms typically make use of high resolution weights, with floating-point notation. However, for dedicated hardware implementations of such algorithms, fixed-point synaptic weights with low resolution are preferable. The basic approach of reducing the resolution of the weights in these algorithms by standard rounding methods incurs dr...
متن کاملislanding detection methods for microgrids
امروزه استفاده از منابع انرژی پراکنده کاربرد وسیعی یافته است . اگر چه این منابع بسیاری از مشکلات شبکه را حل می کنند اما زیاد شدن آنها مسائل فراوانی برای سیستم قدرت به همراه دارد . استفاده از میکروشبکه راه حلی است که علاوه بر استفاده از مزایای منابع انرژی پراکنده برخی از مشکلات ایجاد شده توسط آنها را نیز منتفی می کند . همچنین میکروشبکه ها کیفیت برق و قابلیت اطمینان تامین انرژی مشترکان را افزایش ...
15 صفحه اولTWO LOW-ORDER METHODS FOR THE NUMERICAL EVALUATION OF CAUCHY PRINCIPAL VSlLUE INTEGRALS OF OSCILLATORY KIND
In this paper, we develop two piecewise polynomial methods for the numerical evaluation of Cauchy Principal Value integrals of oscillatory kind. The two piecewisepolynomial quadratures are compact, easy to implement, and are numerically stable. Two numerical examples are presented to illustrate the two rules developed, The convergence of the two schemes is proved and some error bounds obtai...
متن کاملWeights in block iterative methods
In this paper we introduce a sequential block iterative method and its simultaneous version with op-timal combination of weights (instead of convex combination) for solving convex feasibility problems.When the intersection of the given family of convex sets is nonempty, it is shown that any sequencegenerated by the given algorithms converges to a feasible point. Additionally for linear feasibil...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Scientific Computing
سال: 2017
ISSN: 0885-7474,1573-7691
DOI: 10.1007/s10915-017-0540-6